SNKC: An Efficient On-the-fly Pollution Detection Scheme for Content Distribution with Linear Network Coding

Linear network coding (LNC) has attracted significant attention because it has the potential to achieve the throughput capacity of a network. However, transmission systems with LNC are vulnerable to pollution attacks in which normal packets will be corrupted by malicious relay nodes and participate in normal encoding process. The null keys based error detection schemes have been designed to efficiently defend against the pollution attacks, in which null keys are a set of vectors sent from source to relay nodes to verify the correctness of the coded packets. However, the existing null keys based schemes either cannot efficiently distribute the null keys in large scale networks or cannot defend against collusion attacks. In this paper, we design a Short Null Keys Compression (SNKC) scheme. It is designed to reduce the required amount of null keys distributed by the source, so as to defend against collusion attacks efficiently. Specifically, through the design of SNKC scheme, the size of linearly independent null keys, which compose the basis of linear space, will be significantly reduced. Keywords-pollution detection; network coding; content distribution